Algebraic Collision Attacks on Keccak

In this paper, we analyze the collision resistance of two smallest versions Keccak which have a width 200 and 400 bits respectively. We show that algebraic linearization techniques can serve cryptanalysis by using some interesting properties linear part round function Keccak. present an attack on could be used in lightweight cryptography reduced to rounds. For Keccak[40, 160] (resp. Keccak[72, 128] Keccak[144, 256]) our has computational complexity 273 252.5 2101.5) calls.